A Lifting Argument for the Generalized Grigorieff Forcing

6 Fe b 19 93 Combinatorics on Ideals and Axiom A

The following notion of forcing was introduced by Grigorieff [2]: Let I ⊂ ω be an ideal, then P is the set of all functions p : ω → 2 such that dom(p) ∈ I. The usual Cohen forcing corresponds to the case when I is the ideal of finite subsets of ω. In [2] Grigorieff proves that if I is the dual of a p-point ultrafilter, then ω1 is preserved in the generic extension. Later, when Shelah introduced...

Combinatorics on Ideals and Forcing

A natural generalization of Cohen's set of forcing conditions (the t w ~ valued functions with domain a finite subset of w) is the set of twovalued functions with domain an element of an ideal J on ~. The I~roblem treated in this paper is to determine when such forcing yields a generic real of minimal degree of constructibility. A :;imple decomposition argument shows that the non-maximality of ...

The Taylor Method for Numerical Solution of Fuzzy Generalized Pantograph Equations with Linear Functional Argument

Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations

We compare the monadic second-order theory of an arbitrary linear ordering L with the theory of the family of subsets of L endowed with the operation on subsets obtained by lifting the max operation on L. We show that the two theories define the same relations. The same result holds when lifting the min operation or both max and min operations.

On Identities with Additive Mappings in Rings

begin{abstract} If $F,D:Rto R$ are additive mappings which satisfy $F(x^{n}y^{n})=x^nF(y^{n})+y^nD(x^{n})$ for all $x,yin R$. Then, $F$ is a generalized left derivation with associated Jordan left derivation $D$ on $R$. Similar type of result has been done for the other identity forcing to generalized derivation and at last an example has given in support of the theorems. end{abstract}